A scalable association rule learning heuristic for large datasets
نویسندگان
چکیده
منابع مشابه
Heuristic Rule Learning
The primary goal of the research reported in this thesis is to identify what criteria are responsible for the good performance of a heuristic rule evaluation function in a greedy top-down covering algorithm both in classification and regression. We first argue that search heuristics for inductive rule learning algorithms typically trade off consistency and coverage, and we investigate this trad...
متن کاملUnsupervised Clustering: A Fast Scalable Method for Large Datasets
Fast and eeective unsupervised clustering is a fundamental tool in unsupervised learning. Here is a new method to explore large datasets that enjoys many favorable properties. It is fast and eeective, and produces a hierarchical structure on the underlying dataset, without using a training set. It also yields auxiliary information on the signiicance of the diierent attributes.
متن کاملFrom Radial to Rectangular Basis Functions. A new Approach for Rule Learning from Large Datasets
| Automatic extraction of rules from datasets has gained considerable interest during the last few years. Several approaches have been proposed, mainly based on Machine Learning algorithms, the most prominent example being Quinlan's C4.5. In this paper we propose a new method to nd rules in large databases, that make use of so{called Rectangular Basis Functions (or RecBF). Each RecBF directly r...
متن کاملLearning using Large Datasets
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for the case of small-scale and large-scale learning problems. Small-scale learning problems are subject to the usual approximation– estimation tradeoff. Large-scale learning problems are subject to a qualitatively differ...
متن کاملScalable Varied Density Clustering Algorithm for Large Datasets
Finding clusters in data is a challenging problem especially when the clusters are being of widely varied shapes, sizes, and densities. Herein a new scalable clustering technique which addresses all these issues is proposed. In data mining, the purpose of data clustering is to identify useful patterns in the underlying dataset. Within the last several years, many clustering algorithms have been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Big Data
سال: 2021
ISSN: 2196-1115
DOI: 10.1186/s40537-021-00473-3